GRASP and path relinking for project scheduling under partially renewable resources
نویسندگان
چکیده
منابع مشابه
GRASP and path relinking for project scheduling under partially renewable resources
Recently, in the field of project scheduling problems the concept of partially renewable resources has been introduced. Theoretically, it is a generalization of both renewable and non-renewable resources. From an applied point of view, partially renewable resources allow us to model a large variety of situations that do not fit in classical models, but can be found in real problems in timetabli...
متن کاملFast Iterative Improvement Methods for Project Scheduling under Partially Renewable Resources
It is well-known that for many project scheduling problems the space AS of active schedules contains at least one optimal solution for each feasible instance, so restricting heuristic construction methods to AS will improve algorithmic efficiency without foresaking the chance to eventually find an optimal schedule. Yet, for some problems such results are not directly applicable. We address one ...
متن کاملGrasp with Path-relinking for Network Migration Scheduling
Network migration scheduling is the problem where inter-nodal traffic from an outdated telecommunications network is to be migrated to a new network. Nodes are migrated, one at each time period, from the old to the new network. All traffic originating or terminating at given node in the old network is moved to a specific node in the new network. Routing is predetermined on both networks and the...
متن کاملA scatter search algorithm for project scheduling under partially renewable resources
In this paper we develop a heuristic algorithm, based on Scatter Search, for project scheduling problems under partially renewable resources. This new type of resource can be viewed as a generalization of renewable and non-renewable resources, and is very helpful in modelling conditions that do no fit into classical models, but which appear in real timetabling and labor scheduling problems. The...
متن کاملParallel GRASP with path-relinking for job shop scheduling
In the job shop scheduling problem (JSP), a finite set of jobs is processed on a finite set of machines. Each job is required to complete a set of operations in a fixed order. Each operation is processed on a specific machine for a fixed duration. A machine can process no more than one job at a time and once a job initiates processing on a given machine it must complete processing without inter...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2008
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2006.06.073